Optimal Grain Size Computation for
نویسندگان
چکیده
In this paper, we present a method for overlapping communications on parallel computers for pipelined algorithms. We rst introduce a general theoretical model which leads to a generic computation scheme for the optimal packet size. Then, we use the OPIUM 3 library, which provides an easy-to-use and eecient way to compute, in the general case, this optimal packet size, on the column LU factorization; the implementation and performance measures are made on an Intel Paragon.
منابع مشابه
On Optimal Size and Shape of Supernode Transformations
| Supernode transformation has been proposed to reduce the communication startup cost by grouping a number of iterations in a perfectly nested loop with uniform dependencies as a supern-ode which is assigned to a processor as a single unit. A supernode transformation is speciied by n families of hyperplanes which slice the iteration space into parallelepiped supernodes, the grain size of a supe...
متن کاملTwo-dimensional orthogonal tiling: from theory to practice
In pipelined parallel computations the inner loops are often implemented in a block fashion. In such programs, an important compiler optimization involves the need to statically determine the grain size. This paper presents extensions and experimental validation of the previous results of Andonov and Rajopadhye on optimal grain size determination.
متن کاملEstimation of the mean grain size of mechanically induced Hydroxyapatite based bioceramics via artificial neural network
This study focuses on the estimation of the mean grain size of mechanically induced Hydroxyapatite (HA) through the artificial neural network (ANN) model. The mean grain size of HA and HA based nanocomposites at different milling parameters were obtained from previous studies. The data were trained and tested by the neural network modeling. Accordingly, all data (55 sets) were based on the mecha...
متن کاملComputer simulations of two-dimensional and three-dimensional ideal grain growth.
We developed an efficient computation scheme for the phase-field simulation of grain growth, which allows unlimited number of the orientation variables and high computational efficiency independent of them. Large-scale phase-field simulations of the ideal grain growth in two-dimensions (2D) and three-dimensions (3D) were carried out with holding the coalescence-free condition, where a few tens ...
متن کاملA Polynomial Time Method for Optimal Software Pipelining
Software pipelining is one of the most important loop scheduling methods used by parallelizing compilers. It determines a static parallel schedule { a periodic pattern { to overlap instructions of a loop body from diierent iterations. The main contributions of this paper are the following: First, we propose to express the ne-grain loop scheduling problem (in particular, software pipelining) on ...
متن کامل